Approximation of Infinitely Differentiable Functions on the Real Line by Polynomials in Weighted Spaces
نویسندگان
چکیده
By a given family of convex functions on the real axis that grow at infinity faster than any linear function and by certain logarithmically sequence positive numbers, we construct space infinitely differentiable line. Under condition logarithmic gap between weight functions, prove possibility approximation polynomials in this space.
منابع مشابه
Weighted approximation of functions on the real line by Bernstein polynomials
The authors give error estimates, a Voronovskaya-type relation, strong converse results and saturation for the weighted approximation of functions on the real line with Freud weights by Bernstein-type operators. r 2004 Elsevier Inc. All rights reserved.
متن کاملRemarks on Lp-approximation of infinitely differentiable multivariate functions
We study the Lp-approximation problem (1 ≤ p < ∞) for infinitely differentiable d-variate functions with respect to the worst case error. In particular, we correct a mistake in the argumentation of Novak and Woźniakowski [2], who showed that the problem is intractable. The main ingredients are arguments from convex geometry, as well as a probabilistic calculation.
متن کاملCertain subalgebras of Lipschitz algebras of infinitely differentiable functions and their maximal ideal spaces
We study an interesting class of Banach function algebras of innitely dierentiable functions onperfect, compact plane sets. These algebras were introduced by Honary and Mahyar in 1999, calledLipschitz algebras of innitely dierentiable functions and denoted by Lip(X;M; ), where X is aperfect, compact plane set, M = fMng1n=0 is a sequence of positive numbers such that M0 = 1 and(m+n)!Mm+n ( m!Mm)...
متن کاملApproximation of infinitely differentiable multivariate functions is intractable
We prove that L∞-approximation of C ∞-functions defined on [0, 1]d is intractable and suffers from the curse of dimensionality. This is done by showing that the minimal number of linear functionals needed to obtain an algorithm with worst case error at most ε ∈ (0, 1) is exponential in d. This holds despite the fact that the rate of convergence is infinite.
متن کاملApproximation by Trigonometric Polynomials in Weighted Rearrangement Invariant Spaces
We investigate the approximation properties of trigonometric polynomials and prove some direct and inverse theorems for polynomial approximation in weighted rearrangement invariant spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2021
ISSN: ['1072-3374', '1573-8795']
DOI: https://doi.org/10.1007/s10958-021-05486-0